Case-Based Reasoning in Color Matching
نویسندگان
چکیده
A case-based reasoning system for determining what colorants to use for producing a specific color of plastic was created. The selection of colorants needs to take many factors into consideration. A technique that involved fuzzy logic was used to compare the quality of the color match for each factor. The system has been in use for two years at a growing number of GE Plastics sites and has shown significant cost savings.
منابع مشابه
Instrument dependency of Kubelka-Munk theory in computer color matching
Different industries are usually faced with computer color matching as an important problem. The most famous formula which is commonly used for recipe prediction is based on Kubelka-Munk K-M theory. Considering that spectrophotometer’s geometry and its situation influence the measured spectral values, the performance of this method can be affected by the instrument. In the present study, three ...
متن کاملColor scene transform between images using Rosenfeld-Kak histogram matching method
In digital color imaging, it is of interest to transform the color scene of an image to the other. Some attempts have been done in this case using, for example, lαβ color space, principal component analysis and recently histogram rescaling method. In this research, a novel method is proposed based on the Resenfeld and Kak histogram matching algorithm. It is suggested that to transform the color...
متن کاملLicense Plate location Determination by Using Case-Based Reasoning
The license plate recognition system is part of the intelligent transportation system. In the intelligent transportation system, the vehicle image is used as the system input. The first step is to improve the image, after the edge detection, a series of morphological operations are performed to identify the plaque. The main purpose of this research was to increase the importance of plate re...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملImproving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning
In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...
متن کامل